On the Strong Completeness of Åqvist's Dyadic Deontic Logic G
نویسنده
چکیده
Åqvist’s dyadic deontic logic G, which aims at providing an axiomatic characterization of Hansson’s seminal system DSDL3 for conditional obligation, is shown to be strongly complete with respect to its intended modelling.
منابع مشابه
A Note on Nesting in Dyadic Deontic Logic
The paper reports on some results concerning Åqvist’s dyadic logic known as system G, which is one of the most influential logics for reasoning with dyadic obligations (“it ought to be the case that . . . if it is the case that . . . ”). Although this logic has been known in the literature for a while, many of its properties still await in-depth consideration. In this short paper we show: that ...
متن کاملMaximality vs. Optimality in Dyadic Deontic Logic Completeness Results for Systems in Hansson’s Tradition
This paper reports completeness results for dyadic deontic logics in the tradition of Hansson’s systems. There are two ways to understand the core notion of best antecedentworlds, which underpins such systems. One is in terms of maximality, and the other in terms of optimality. Depending on the choice being made, one gets different evaluation rules for the deontic modalities, but also different...
متن کاملFaithful Semantical Embedding of a Dyadic Deontic Logic in HOL
A shallow semantical embedding of a dyadic deontic logic by Carmo and Jones in classical higher-order logic is presented. This embedding is proven sound and complete, that is, faithful. The work presented here provides the theoretical foundation for the implementation and automation of dyadic deontic logic within off-the-shelf higherorder theorem provers and proof assistants.
متن کاملProhairetic Deontic Logic and Qualitative Decision Theory
In this paper we introduce Prohairetic Deontic Logic, a preference-based dyadic deontic logic. An obligation ‘ should be (done) if is (done)’ is true if (1) no: ^ is preferred to an ^ and (2) the preferred are . We show that this mixed representation solves several problems of deontic logic. Moreover, we discuss the relation between preferencebased deontic logic and qualitative decision theory.
متن کاملA Dyadic Operator for the Gradation of Desirability
We propose a normal modal deontic logic based on a dyadic operator, similar in structure to the temporal “until”. By bringing significant expressiveness to the logic, it allows both the definition of a monadic desirability operator similar to the SDL obligation, and the expression of the relative level of desirability of target formulae. The interpretation of this logic on a linear structure of...
متن کامل